Planar Pixelations and Image Recognition
نویسنده
چکیده
Any subset of the plane can be approximated by a set of square pixels. This transition from a shape to its pixelation is rather brutal since it destroys geometric and topological information about the shape. Using a technique inspired by Morse Theory, we algorithmically produce a PL approximation of the original shape using only information from its pixelation. This approximation converges to the original shape in a very strong sense: as the size of the pixels goes to zero we can recover important geometric and topological invariants of the original shape such as Betti numbers, area, perimeter and curvature measures.
منابع مشابه
A New Approach towards Precise Planar Feature Characterization Using Image Analysis of FMI Image: Case Study of Gachsaran Oil Field Well No. 245, South West of Iran
Formation micro imager (FMI) can directly reflect changes of wall stratums and rock structures. Conventionally, FMI images mainly are analyzed with manual processing, which is extremely inefficient and incurs a heavy workload for experts. Iranian reservoirs are mainly carbonate reservoirs, in which the fractures have an important effect on permeability and petroleum production. In this paper, a...
متن کاملPixelations of planar semialgebraic sets and shape recognition
We describe an algorithm that associates to each positive real number r and each finite collection Cr of planar pixels of size r a planar piecewise linear set Sr with the following additional property: if Cr is the collection of pixels of size r that touch a given compact semialgebraic set S, then the normal cycle of Sr converges to the normal cycle of S in the sense of currents. In particular,...
متن کاملPlanar Pixelations, Shape Reconstruction
Given a PL (piecewise linear) set S in the plane R we consider the set Pε(S) consisting of all pixels of size ε that touch S. This pixelation Pε(S) resembles the original set, but may not well approximate various important invariants of the original set such as Betti numbers, perimeter, curvature measures. We describe an algorithm that associates to the pixelation Pε(S) a PL-set Pε(S) which app...
متن کاملPixelations of planar semialgebraic sets
We describe an algorithm that associates to each positive real number r and each finite collection Cr of planar pixels of size r a planar piecewise linear set Sr with the following additional property: if Cr is the collection of pixels of size r that touch a given compact semialgebraic set S, then the normal cycle of Sr converges to the normal cycle of S in the sense of currents. In particular,...
متن کاملA New Approach for Quantitative Evaluation of Reconstruction Algorithms in SPECT
ABTRACT Background: In nuclear medicine, phantoms are mainly used to evaluate the overall performance of the imaging systems and practically there is no phantom exclusively designed for the evaluation of the software performance. In this study the Hoffman brain phantom was used for quantitative evaluation of reconstruction techniques. The phantom is modified to acquire t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1105.2831 شماره
صفحات -
تاریخ انتشار 2011